Improving strong branching by domain propagation
نویسندگان
چکیده
منابع مشابه
Improving strong branching by domain propagation
One of the essential components of a branch-and-bound based mixed-integer linear programming (MIP) solver is the branching rule. Strong branching is a method used by many state-of-the-art branching rules to select the variable to branch on. It precomputes the dual bounds of potential child nodes by solving auxiliary linear programs (LPs) and thereby helps to take good branching decisions that l...
متن کاملImproving Strong Branching by Propagation
Strong branching is an important component of most variable selection rules in branchand-bound based mixed-integer linear programming solvers. It predicts the dual bounds of potential child nodes by solving auxiliary LPs and thereby helps to keep the branchand-bound tree small. In this paper, we describe how these dual bound predictions can be improved by including domain propagation into stron...
متن کاملImproving the LP bound of a MILP by branching concurrently
In this paper the branching trees for attacking MILP are reviewed. Under certain circumstances branches can be done concurrently. This is fully investigated with the result that there are restrictions for certain dual values and reduced costs. As a sideeffect of this study a new class of cuts for MILP is found, which are defined by those values. 1 Motivation of the following thoughts Nowadays t...
متن کاملImproving Propositional Satisfiability Algorithms by Dynamic Selection of Branching Rules
The problem of proving that a propositional boolean formula is satisfiable (SAT) is one of the fundamental problems in computer science. The most popular SAT algorithms are based on the well known Davis-Putnam procedure. There, to guide search, a branching rule is applied for selecting still unassigned variables and computing an assignment to this variable. Additionally, conflict analysis metho...
متن کاملGPU Accelerated Strong and Branching Bisimilarity Checking
Bisimilarity checking is an important operation to perform explicit-state model checking when the state space of a model under verification has already been generated. It can be applied in various ways: reduction of a state space w.r.t. a particular flavour of bisimilarity, or checking that two given state spaces are bisimilar. Bisimilarity checking is a computationally intensive task, and over...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Computational Optimization
سال: 2014
ISSN: 2192-4406,2192-4414
DOI: 10.1007/s13675-014-0021-8